Codes over Zm, revisited

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CYCLIC CODES AND THEIR DUALS OVER Zm

In this paper we study the cyclic codes over Zm as being Zm-submodules of ZmG and we find their minimal generating sets. We also study the dual codes of cyclic codes and find their generators as being ideals in ZmG. Throughout this paper, we assume m = q, q is a prime number and (n, q) = 1.

متن کامل

A generalized DFT for Abelian codes over Zm

r,-/r i+1 , and N D (Cj) is the complexity of the algorithm used in the soft-decision ML decoding of C L. Therefore, the overall complexity (normalized to two dimensions) of the generalized multistage decoding algorithm can then be estimated by b ~ i 7V D (A ;) + b. (3) From Theorem 5, and (l)-(3), we are able to determine the performance and the complexity of the proposed algorithm in the deco...

متن کامل

Arithmetic circuit classes over Zm

We continue the study of the complexity classes VP(Zm) and ΛP(Zm) which was initiated in [AGM15]. We distinguish between “strict” and “lax” versions of these classes and prove some new equalities and inclusions between these arithmetic circuit classes and various subclasses of ACC.

متن کامل

Inversion of Circulant Matrices over Zm

In this paper we consider the problem of inverting an n × n circulant matrix with entries over Zm. We show that the algorithm for inverting circulants, based on the reduction to diagonal form by means of FFT, has some drawbacks when working over Zm. We present three different algorithms which do not use this approach. Our algorithms require different degrees of knowledge of m and n, and their c...

متن کامل

Symmetric Polynomials over Zm and Simultaneous Communication Protocol

We study the problem of representing symmetric Boolean functions as symmetric polynomials over . We show an equivalence between such representations and simultaneous communication protocols. Computing a function with a polynomial of degree modulo is equivalent to a two player simultaneous protocol for computing where one player is given the first digits of the weight in base and the other is gi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1978

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(78)90461-8